On the Chromatic Number of Simple Triangle-Free Triple Systems
نویسندگان
چکیده
منابع مشابه
On the Chromatic Number of Simple Triangle-Free Triple Systems
A hypergraph is simple if every two edges share at most one vertex. It is trianglefree if in addition every three pairwise intersecting edges have a vertex in common. We prove that there is an absolute constant c such that the chromatic number of a simple triangle-free triple system with maximum degree ∆ is at most c √ ∆/ log ∆. This extends a result of Johansson about graphs, and is sharp apar...
متن کاملComment on “ On the chromatic number of simple triangle - free triple systems ”
We have found several errors in the paper [1] and the goal here is to present corrections to all of them. Equational references with square brackets [..] are with respect to the published version. Those with round brackets (..) are with respect to this comment. The notation is from [1]. There was a substantial error in the proof of [15] (in Section 11.4.1 of [1]) and a trivial error in the calc...
متن کاملThe triangle chromatic index of Steiner triple systems
In a Steiner triple system of order v, STS(v), a set of three lines intersecting pairwise in three distinct points is called a triangle. A set of lines containing no triangle is called triangle-free. The minimum number of triangle-free sets required to partition the lines of a Steiner triple system S, is called the triangle chromatic index of S. We prove that for all admissible v, there exists ...
متن کاملThe fractional chromatic number of triangle-free subcubic graphs
Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic graph is at most 14/5. Improving on estimates of Hatami and Zhu and of Lu and Peng, we prove that the fractional chromatic number of any triangle-free subcubic graph is at most 32/11 ≈ 2.909.
متن کاملCycles in triangle-free graphs of large chromatic number
More than twenty years ago Erdős conjectured [4] that a triangle-free graph G of chromatic number k ≥ k0(ε) contains cycles of at least k2−ε different lengths as k →∞. In this paper, we prove the stronger fact that every triangle-free graph G of chromatic number k ≥ k0(ε) contains cycles of 1 64 (1− ε)k 2 log k4 consecutive lengths, and a cycle of length at least 14 (1− ε)k 2 log k. As there ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2008
ISSN: 1077-8926
DOI: 10.37236/845